A Note on the Fundamental Limits of Coded Caching
نویسنده
چکیده
The fundamental limit of coded caching is investigated for the case with N = 3 files and K = 3 users. An improved outer bound is obtained through the computational approach developed by the author in an earlier work. This result is part of the online collection of “Solutions of Computed Information Theoretic Limits (SCITL)”.
منابع مشابه
Optimization of Heterogeneous Coded Caching
This paper aims to provide an optimization framework for coded caching that accounts for various heterogeneous aspects of practical systems. An optimization theoretic perspective on the seminal work on the fundamental limits of caching by Maddah Ali and Niesen is first developed, whereas it is proved that the coded caching scheme presented in that work is the optimal scheme among a large, non-t...
متن کاملFundamental Limits of Caching: Improved Bounds For Small Buffer Users
In this work, the peak rate of the caching problem is investigated, under the scenario that the users are with small buffer sizes and the number of users is no less than the amount of files in the server. A novel coded caching strategy is proposed for such a scenario, leading to a lower peak rate compared to recent results in the literature. Furthermore, it is verified that our peak rates coinc...
متن کاملOptimal Error Correcting Delivery Scheme for an Optimal Coded Caching Scheme with Small Buffers
Optimal delivery scheme for coded caching problems with small buffer sizes and the number of users no less than the amount of files in the server was proposed by Chen, Fan and Letaief [“Fundamental limits of caching: improved bounds for users with small buffers," IET Communications, 2016]. This scheme is referred to as the CFL scheme. In this paper, the link between the server and the users is ...
متن کاملFundamental Limits of Heterogenous Cache
Recently, a novel technique called coded cache have been proposed to facilitate the wireless content distribution. Assuming the users have the identical cache size, prior works have described the fundamental performance limits of such scheme. However, when heterogenous user cache sizes is taken into account, there remains open questions regarding the performance of the cache. In this work, for ...
متن کاملFundamental Limits of Caching: Improved Delivery Rate-Cache Capacity Trade-off
We consider a centralized coded caching system consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link. Each user is equipped with a local cache of capacity MF bits. The contents can be proactively cached into the user caches by the server over low traffic period; however, without the knowledge of the user demands. During the peak tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1503.00010 شماره
صفحات -
تاریخ انتشار 2015